Reversing an imperative concurrent programming language

We introduce a method of reversing the execution imperative concurrent programs. Given an irreversible program, we describe process producing two versions. The first performs forward and saves information necessary for reversal. second uses this saved to simulate propose using identifiers capture statement order, use correctly undo data races via backtracking reversibility. prove reversibility be correct, showing that initial program state is restored all used (garbage-clean).